IBM proves a quantum computing advantage over classical | NextBigFuture.com

IBM scientists have mathematically proven that there are certain problems that require only a fixed circuit depth when done on a quantum computer no matter how the number of inputs increase. On a classical computer, these same problems require the circuit depth to grow larger. The proof is that there will be problems that can only be done on quantum computers and other which can be done much faster on quantum computers. There is predicted polynomial speedup for Hidden Linear Functions. We would need millions and millions of extremely high-quality qubits with low error rates and long coherence time for The post IBM proves a quantum computing advantage over classical appeared first on NextBigFuture.com.